翻訳と辞書 |
Conway puzzle : ウィキペディア英語版 | Conway puzzle
Conway's puzzle, or Blocks-in-a-Box, is a packing problem using rectangular blocks, named after its inventor, mathematician John Conway. It calls for packing thirteen 1 × 2 × 4 blocks, one 2 × 2 × 2 block, one 1 × 2 × 2 block, and three 1 × 1 × 3 blocks into a 5 × 5 × 5 box. ==Solution==
The solution of the Conway puzzle is straightforward when one realizes, based on parity considerations, that the three 1 × 1 × 3 blocks need to be placed so that precisely one of them appears in each 5 × 5 × 1 slice of the cube.〔Elwyn R. Berlekamp, John H. Conway and Richard K. Guy: winning ways for your mathematical plays, 2nd ed, vol. 4, 2004.〕 This is analogous to similar insight that facilitates the solution of the simpler Slothouber–Graatsma puzzle.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Conway puzzle」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|